Using memory and fuzzy rules in a co-operative multi-thread strategy for optimization

In this article, we analyze a co-operative multi-thread search-based optimization strategy, where each solver thread represents a different optimization algorithm (or the same one with different settings), and they are all controlled by a centralized co-ordinator. We also propose the use of memory to keep track of both the state of the individual threads and the obtained solutions. Based on this memory, a very simple fuzzy rule base is used to control the system behavior. We also present the results of three computational experiments. The first of these checks the strategy by comparing it with an independent search strategy and a sequential algorithm, and the superiority of the co-operative scheme is confirmed. The second analyzes how definition of the threads affects the quality of the results, and the importance of there being a balanced set between intensification and diversification is corroborated. The third explores the use of memory with two different fuzzy rules, and the results indicate that the best combination is to use memory together with two rules 0020-0255/$ see front matter 2005 Elsevier Inc. All rights reserved. doi:10.1016/j.ins.2005.06.007 * Corresponding author. E-mail addresses: [email protected] (D. Pelta), [email protected] (A. Sancho-Royo), [email protected] (C. Cruz), [email protected] (J.L. Verdegay). 1850 D. Pelta et al. / Information Sciences 176 (2006) 1849–1868 (solver dependent and solver independent ones) (although this combination should not be activated at the beginning of the search in order to avoid premature convergence). 2005 Elsevier Inc. All rights reserved.